ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION
نویسندگان
چکیده
منابع مشابه
Singular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملAn Analysis of Transformation on Non-Positive Semidefinite Similarity Matrix for Kernel Machines
Many emerging applications formulate nonpositive semidefinite similarity matrices, and hence cannot fit into the framework of kernel machines. A popular approach to this problem is to transform the spectrum of the similarity matrix so as to generate a positive semidefinite kernel matrix. In this paper, we present an analytical framework to explore four representative transformation methods: den...
متن کاملOn Doubly Positive Semidefinite Programming Relaxations
Recently, researchers have been interested in studying the semidefinite programming (SDP) relaxation model, where the matrix is both positive semidefinite and entry-wise nonnegative, for quadratically constrained quadratic programming (QCQP). Comparing to the basic SDP relaxation, this doubly-positive SDP model possesses additional O(n2) constraints, which makes the SDP solution complexity subs...
متن کاملPositive Semidefinite Germs on the Cone
The problem of representing a positive semidefinite function (=psd) as a sum of squares (=sos) is a very old matter in real algebra and real geometry. Still, it is a difficult question always appealing the specialists. Concerning real analytic germs we can summarize what is known in a few statements. Let X be a irreducible real analytic set germ of dimension d. Any psd f of X is an sos of merom...
متن کاملCompletely Positive Semidefinite Rank
An n×n matrix X is called completely positive semidefinite (cpsd) if there exist d×d Hermitian positive semidefinite matrices {Pi}i=1 (for some d ≥ 1) such that Xij = Tr(PiPj), for all i, j ∈ {1, . . . , n}. The cpsd-rank of a cpsd matrix is the smallest d ≥ 1 for which such a representation is possible. In this work we initiate the study of the cpsd-rank which we motivate twofold. First, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of applied mathematics & informatics
سال: 2015
ISSN: 1598-5857
DOI: 10.14317/jami.2015.229